Fair Queueing by Youngsub Chun

Author:Youngsub Chun
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

(6.16)

Hence, it follows that is a constant and

(6.17)

where c k is a player-specific constant.

Since the f function is the same for all agents, it follows that for all and all i ∈ N,

By weak budget balance and equal treatment of equals, for all i ∈ N, c i  = 0 and the result follows by substituting for . □

Remark 6.15

We now show that all axioms are necessary for the characterization. 1.Dropping queue-efficiency: Let N = { 1, 2}. For k = 1, the example in Remark 6.12 (1) and for k = 2, the example in Remark 6.13(1) satisfy equal treatment of equals, strategyproofness, k-independence of preceding costs, k-independence of following costs, and weak budget balance.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.